Quantitative results on Fejér monotone sequences
نویسندگان
چکیده
We provide in a unified way quantitative forms of strong convergence results for numerous iterative procedures which satisfy a general type of Fejér monotonicity where the convergence uses the compactness of the underlying set. These quantitative versions are in the form of explicit rates of so-called metastability in the sense of T. Tao. Our approach covers examples ranging from the proximal point algorithm for maximal monotone operators to various fixed point iterations (xn) for firmly nonexpansive, asymptotically nonexpansive, strictly pseudo-contractive and other types of mappings. Many of the results hold in a general metric setting with some convexity structure added (so-called W -hyperbolic spaces). Sometimes uniform convexity is assumed still covering the important class of CAT(0)-spaces due to Gromov.
منابع مشابه
Moduli of regularity and rates of convergence for Fejér monotone sequences
In this paper we introduce the concept of modulus of regularity as a tool to analyze the speed of convergence, including the finite termination, for classes of Fejér monotone sequences which appear in fixed point theory, monotone operator theory, and convex optimization. This concept allows for a unified approach to several notions such as metric subregularity, Hölder regularity, weak sharp min...
متن کاملBall Intersection Model for Fejér Zones of Convex Closed Sets
Strongly Fejér monotone mappings are widely used to solve convex problems by corresponding iterative methods. Here the maximal of such mappings with respect to set inclusion of the images are investigated. These mappings supply restriction zones for the successors of Fejér monotone iterative methods. The basic tool is the representation of the images by intersection of certain balls.
متن کاملSignal Reconstruction from given Phase of the Fourier Transform Using Fejér Monotone Methods
The aim is to reconstruct a signal function x ∈ L2 if the phase of the Fourier transform x̂ and some additional a-priori information of convex type are known. The problem can be described as a convex feasibility problem. We solve this problem by different Fejér monotone iterative methods comparing the results and discussing the choice of relaxation parameters. Since the a-priori information is p...
متن کاملCommon Zero Points of Two Finite Families of Maximal Monotone Operators via Proximal Point Algorithms
In this work, it is presented iterative schemes for achieving to common points of the solutions set of the system of generalized mixed equilibrium problems, solutions set of the variational inequality for an inverse-strongly monotone operator, common fixed points set of two infinite sequences of relatively nonexpansive mappings and common zero points set of two finite sequences of maximal monot...
متن کاملA New Note on Almost Increasing and Quasi Monotone Sequences
In [22], we proved a main theorem dealing an application of almost increasing and quasi monotone sequences. In this paper, we prove that theorem under weaker conditions. We also obtained some new and known results.
متن کامل